0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-ho \
0.00/0.00	  --no-avatar \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2 \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n143.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:39:08 CST 2018
0.00/0.25	% done 120 iterations in 0.049s
0.00/0.25	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.25	% SZS output start Refutation
0.00/0.25	tff('thm/iterate/NSUM_SUBSET_', axiom,
0.00/0.25	  (![A:$tType,A0:(A > $o),A1:(A > $o),A2:(A > 'type/nums/num')]:
0.00/0.25	     (((![A3:A]:
0.00/0.25	          ('const/sets/IN'(A,A3,'const/sets/DIFF'(A,A0,A1)) =>
0.00/0.25	           (A2(A3) = 'const/nums/NUMERAL'('const/nums/_0')))) & 
0.00/0.25	       'const/sets/FINITE'(A,A1) & 'const/sets/FINITE'(A,A0)) =>
0.00/0.25	      'const/arith/<='('const/iterate/nsum'(A,A0,A2),
0.00/0.25	                       'const/iterate/nsum'(A,A1,A2))))).
0.00/0.25	tff('0', plain,
0.00/0.25	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o, X3 : X0 > 'type/nums/num']:
0.00/0.25	      (~ 'const/sets/FINITE'(X0, X1)
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X2)
0.00/0.25	       | 'const/sets/IN'(X0, sk_A3(X0, X3, X2, X1), 
0.00/0.25	           'const/sets/DIFF'(X0, X1, X2))
0.00/0.25	       | 'const/arith/<='('const/iterate/nsum'(X0, X1, X3), 
0.00/0.25	           'const/iterate/nsum'(X0, X2, X3))),
0.00/0.25	    inference('cnf', [status(esa)], [thm/iterate/NSUM_SUBSET_])).
0.00/0.25	tff('thm/sets/IN_DIFF_', axiom,
0.00/0.25	  (![A:$tType,A0:(A > $o),A1:(A > $o),A2:A]:
0.00/0.25	     ('const/sets/IN'(A,A2,'const/sets/DIFF'(A,A0,A1)) <=>
0.00/0.25	      ((~'const/sets/IN'(A,A2,A1)) & 'const/sets/IN'(A,A2,A0))))).
0.00/0.25	tff('1', plain,
0.00/0.25	    ![X12 : $tType, X13 : X12, X14 : X12 > $o, X15 : X12 > $o]:
0.00/0.25	      ('const/sets/IN'(X12, X13, X15)
0.00/0.25	       | ~ 'const/sets/IN'(X12, X13, 'const/sets/DIFF'(X12, X15, X14))),
0.00/0.25	    inference('cnf', [status(esa)], [thm/sets/IN_DIFF_])).
0.00/0.25	tff('2', plain,
0.00/0.25	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o, X3 : X0 > 'type/nums/num']:
0.00/0.25	      (~ $true
0.00/0.25	       | 'const/arith/<='('const/iterate/nsum'(X0, X2, X3), 
0.00/0.25	           'const/iterate/nsum'(X0, X1, X3))
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X1)
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X2)
0.00/0.25	       | 'const/sets/IN'(X0, sk_A3(X0, X3, X1, X2), X2)),
0.00/0.25	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.25	tff('3', plain,
0.00/0.25	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o, X3 : X0 > 'type/nums/num']:
0.00/0.25	      ('const/sets/IN'(X0, sk_A3(X0, X3, X1, X2), X2)
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X2)
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X1)
0.00/0.25	       | 'const/arith/<='('const/iterate/nsum'(X0, X2, X3), 
0.00/0.25	           'const/iterate/nsum'(X0, X1, X3))),
0.00/0.25	    inference('simplify', [status(thm)], ['2'])).
0.00/0.25	tff('thm/iterate/NSUM_SUBSET_SIMPLE_', conjecture,
0.00/0.25	  (![A:$tType,A0:(A > $o),A1:(A > $o),A2:(A > 'type/nums/num')]:
0.00/0.25	     (('const/sets/SUBSET'(A,A0,A1) & 'const/sets/FINITE'(A,A1)) =>
0.00/0.25	      'const/arith/<='('const/iterate/nsum'(A,A0,A2),
0.00/0.25	                       'const/iterate/nsum'(A,A1,A2))))).
0.00/0.25	tff(zf_stmt_0, negated_conjecture,
0.00/0.25	  (~
0.00/0.25	    (![A:$tType,A0:(A > $o),A1:(A > $o),A2:(A > 'type/nums/num')]:
0.00/0.25	       (('const/sets/SUBSET'(A,A0,A1) & 'const/sets/FINITE'(A,A1)) =>
0.00/0.25	        'const/arith/<='('const/iterate/nsum'(A,A0,A2),
0.00/0.25	                         'const/iterate/nsum'(A,A1,A2)))))).
0.00/0.25	tff('4', plain,
0.00/0.25	    ~ 'const/arith/<='('const/iterate/nsum'(sk_A, sk_A0, sk_A21), 
0.00/0.25	        'const/iterate/nsum'(sk_A, sk_A1, sk_A21)),
0.00/0.25	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.25	tff('5', plain,
0.00/0.25	    (~ $true
0.00/0.25	     | ~ 'const/sets/FINITE'(sk_A, sk_A1)
0.00/0.25	     | ~ 'const/sets/FINITE'(sk_A, sk_A0)
0.00/0.25	     | 'const/sets/IN'(sk_A, sk_A3(sk_A, sk_A21, sk_A1, sk_A0), sk_A0)),
0.00/0.25	    inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.25	tff('6', plain, 'const/sets/FINITE'(sk_A, sk_A1),
0.00/0.25	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.25	tff('7', plain, 'const/sets/SUBSET'(sk_A, sk_A0, sk_A1),
0.00/0.25	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.25	tff('thm/sets/FINITE_SUBSET_', axiom,
0.00/0.25	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.25	     (('const/sets/SUBSET'(A,A0,A1) & 'const/sets/FINITE'(A,A1)) =>
0.00/0.25	      'const/sets/FINITE'(A,A0)))).
0.00/0.25	tff('8', plain,
0.00/0.25	    ![X4 : $tType, X5 : X4 > $o, X6 : X4 > $o]:
0.00/0.25	      ('const/sets/FINITE'(X4, X5)
0.00/0.25	       | ~ 'const/sets/SUBSET'(X4, X5, X6)
0.00/0.25	       | ~ 'const/sets/FINITE'(X4, X6)),
0.00/0.25	    inference('cnf', [status(esa)], [thm/sets/FINITE_SUBSET_])).
0.00/0.25	tff('9', plain,
0.00/0.25	    (~ $true
0.00/0.25	     | ~ 'const/sets/FINITE'(sk_A, sk_A1)
0.00/0.25	     | 'const/sets/FINITE'(sk_A, sk_A0)),
0.00/0.25	    inference('sup-', [status(thm)], ['7', '8'])).
0.00/0.25	tff('10', plain, (~ $true | ~ $true | 'const/sets/FINITE'(sk_A, sk_A0)),
0.00/0.25	    inference('demod', [status(thm)], ['9', '6'])).
0.00/0.25	tff('11', plain, 'const/sets/FINITE'(sk_A, sk_A0),
0.00/0.25	    inference('simplify', [status(thm)], ['10'])).
0.00/0.25	tff('12', plain,
0.00/0.25	    (~ $true
0.00/0.25	     | ~ $true
0.00/0.25	     | ~ $true
0.00/0.25	     | 'const/sets/IN'(sk_A, sk_A3(sk_A, sk_A21, sk_A1, sk_A0), sk_A0)),
0.00/0.25	    inference('demod', [status(thm)], ['5', '6', '11'])).
0.00/0.25	tff('13', plain,
0.00/0.25	    'const/sets/IN'(sk_A, sk_A3(sk_A, sk_A21, sk_A1, sk_A0), sk_A0),
0.00/0.25	    inference('simplify', [status(thm)], ['12'])).
0.00/0.25	tff('thm/sets/SUBSET_', axiom,
0.00/0.25	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.25	     ('const/sets/SUBSET'(A,A0,A1) <=>
0.00/0.25	      (![A2:A]: ('const/sets/IN'(A,A2,A0) => 'const/sets/IN'(A,A2,A1)))))).
0.00/0.25	tff('14', plain,
0.00/0.25	    ![X7 : $tType, X8 : X7, X9 : X7 > $o, X10 : X7 > $o]:
0.00/0.25	      (~ 'const/sets/IN'(X7, X8, X9)
0.00/0.25	       | 'const/sets/IN'(X7, X8, X10)
0.00/0.25	       | ~ 'const/sets/SUBSET'(X7, X9, X10)),
0.00/0.25	    inference('cnf', [status(esa)], [thm/sets/SUBSET_])).
0.00/0.25	tff('15', plain,
0.00/0.25	    ![X0 : sk_A > $o]:
0.00/0.25	      (~ $true
0.00/0.25	       | ~ 'const/sets/SUBSET'(sk_A, sk_A0, X0)
0.00/0.25	       | 'const/sets/IN'(sk_A, sk_A3(sk_A, sk_A21, sk_A1, sk_A0), X0)),
0.00/0.25	    inference('sup-', [status(thm)], ['13', '14'])).
0.00/0.25	tff('16', plain,
0.00/0.25	    ![X0 : sk_A > $o]:
0.00/0.25	      ('const/sets/IN'(sk_A, sk_A3(sk_A, sk_A21, sk_A1, sk_A0), X0)
0.00/0.25	       | ~ 'const/sets/SUBSET'(sk_A, sk_A0, X0)),
0.00/0.25	    inference('simplify', [status(thm)], ['15'])).
0.00/0.25	tff('17', plain,
0.00/0.25	    ![X12 : $tType, X13 : X12, X14 : X12 > $o, X15 : X12 > $o]:
0.00/0.25	      (~ 'const/sets/IN'(X12, X13, X14)
0.00/0.25	       | ~ 'const/sets/IN'(X12, X13, 'const/sets/DIFF'(X12, X15, X14))),
0.00/0.25	    inference('cnf', [status(esa)], [thm/sets/IN_DIFF_])).
0.00/0.25	tff('18', plain,
0.00/0.25	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o, X3 : X0 > 'type/nums/num']:
0.00/0.25	      (~ $true
0.00/0.25	       | 'const/arith/<='('const/iterate/nsum'(X0, X2, X3), 
0.00/0.25	           'const/iterate/nsum'(X0, X1, X3))
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X1)
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X2)
0.00/0.25	       | ~ 'const/sets/IN'(X0, sk_A3(X0, X3, X1, X2), X1)),
0.00/0.25	    inference('sup-', [status(thm)], ['0', '17'])).
0.00/0.25	tff('19', plain,
0.00/0.25	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o, X3 : X0 > 'type/nums/num']:
0.00/0.25	      (~ 'const/sets/IN'(X0, sk_A3(X0, X3, X1, X2), X1)
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X2)
0.00/0.25	       | ~ 'const/sets/FINITE'(X0, X1)
0.00/0.25	       | 'const/arith/<='('const/iterate/nsum'(X0, X2, X3), 
0.00/0.25	           'const/iterate/nsum'(X0, X1, X3))),
0.00/0.25	    inference('simplify', [status(thm)], ['18'])).
0.00/0.25	tff('20', plain,
0.00/0.25	    (~ $true
0.00/0.25	     | ~ 'const/sets/SUBSET'(sk_A, sk_A0, sk_A1)
0.00/0.25	     | 'const/arith/<='('const/iterate/nsum'(sk_A, sk_A0, sk_A21), 
0.00/0.25	         'const/iterate/nsum'(sk_A, sk_A1, sk_A21))
0.00/0.25	     | ~ 'const/sets/FINITE'(sk_A, sk_A1)
0.00/0.25	     | ~ 'const/sets/FINITE'(sk_A, sk_A0)),
0.00/0.25	    inference('sup-', [status(thm)], ['16', '19'])).
0.00/0.25	tff('21', plain,
0.00/0.25	    (~ $true
0.00/0.25	     | ~ $true
0.00/0.25	     | 'const/arith/<='('const/iterate/nsum'(sk_A, sk_A0, sk_A21), 
0.00/0.25	         'const/iterate/nsum'(sk_A, sk_A1, sk_A21))
0.00/0.25	     | ~ $true
0.00/0.25	     | ~ $true),
0.00/0.25	    inference('demod', [status(thm)], ['20', '7', '6', '11'])).
0.00/0.25	tff('22', plain,
0.00/0.25	    'const/arith/<='('const/iterate/nsum'(sk_A, sk_A0, sk_A21), 
0.00/0.25	      'const/iterate/nsum'(sk_A, sk_A1, sk_A21)),
0.00/0.25	    inference('simplify', [status(thm)], ['21'])).
0.00/0.25	tff('23', plain, ~ $true, inference('sup-', [status(thm)], ['22', '4'])).
0.00/0.25	tff('24', plain, $false, inference('simplify', [status(thm)], ['23'])).
0.00/0.25	
0.00/0.25	% SZS output end Refutation
0.00/0.25	EOF
